Automatic Choice of Scheduling Heuristics for Parallel/Distributed Computing
نویسندگان
چکیده
منابع مشابه
Automatic choice of scheduling heuristics for parallel/distributed computing
Task mapping and scheduling are two very difficult problems that must be addressed when a sequential program is transformed into a parallel program. Since these problems are NP-hard, compiler writers have opted to concentrate their efforts on optimizations that produce immediate gains in performance. As a result, current parallelizing compilers either use very simple methods to deal with task s...
متن کاملAutomatic Generation of Heuristics for Scheduling
This paper presents a technique, called GENH, that automatically generates search heuristics for scheduling problems. The impetus for developing this technique is the growing consensus that heuristics encode advice that is, at best, useful in solving most, or typical, problem instances, and, at worst, useful in solving only a narrowly defined set of instances. In either case, heuristic problem ...
متن کاملAn automatic method for discovering rational heuristics for risky choice
What is the optimal way to make a decision given that your time is limited and your cognitive resources are bounded? To answer this question, we formalized the bounded optimal decision process as the solution to a meta-level Markov decision process whose actions are costly computations. We approximated the optimal solution and evaluated its predictions against human choice behavior in the Mouse...
متن کاملDistributed Choice Function Hyper-heuristics for Timetabling and Scheduling
This paper investigates an emerging class of search algorithms, in which high-level domain independent heuristics, called hyperheuristics, iteratively select and execute a set of application specific but simple search moves, called low-level heuristics, working toward achieving improved or even optimal solutions. Parallel architectures have been designed and evaluated. Results based on a univer...
متن کاملComparison of Contention Aware List Scheduling Heuristics for Cluster Computing
In the area of static scheduling, list scheduling is one of the most common heuristics for the temporal and spatial assignment of a Directed Acyclic Graph (DAG) to a target machine. As most heuristics, list scheduling assumes fully connected homogeneous processors and ignores contention on the inter communication links. This article extends the list scheduling heuristic for contention aware sch...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific Programming
سال: 1999
ISSN: 1058-9244,1875-919X
DOI: 10.1155/1999/898723